Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems

Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of a feasible solution by the image of some solution in the approximation set up to a multiplicative factor in each component, a convex approximation set only requires this multiplicative approximation to be achieved by some convex combination of finitely many images of solutions in the set. This makes convex approximation sets efficiently computable for a wide range of multiobjective problems - even for many problems for which (classic) approximations sets are hard to compute. In this article, we propose a polynomial-time algorithm to compute convex approximation sets that builds upon an exact or approximate algorithm for the weighted sum scalarization and is, therefore, applicable to a large variety of multiobjective optimization problems. The provided convex approximation quality is arbitrarily close to the approximation quality of the underlying algorithm for the weighted sum scalarization. In essence, our algorithm can be interpreted as an approximate variant of the dual variant of Benson's Outer Approximation Algorithm. Thus, in contrast to existing convex approximation algorithms from the literature, information on solutions obtained during the approximation process is utilized to significantly reduce both the practical running time and the cardinality of the returned solution sets while still guaranteeing the same worst-case approximation quality. We underpin these advantages by the first comparison of all existing convex approximation algorithms on several instances of the triobjective knapsack problem and the triobjective symmetric metric traveling salesman problem

Monitoring cortical excitability during repetitive transcranial magnetic stimulation in children with ADHD: a single-blind, sham-controlled TMS-EEG study

Background: Repetitive transcranial magnetic stimulation (rTMS) allows non-invasive stimulation of the human brain. However, no suitable marker has yet been established to monitor the immediate rTMS effects on cortical areas in children. Objective: TMS-evoked EEG potentials (TEPs) could present a well-suited marker for real-time monitoring. Monitoring is particularly important in children where only few data about rTMS effects and safety are currently available. Methods: In a single-blind sham-controlled study, twenty-five school-aged children with ADHD received subthreshold 1 Hz-rTMS to the primary motor cortex. The TMS-evoked N100 was measured by 64-channel-EEG pre, during and post rTMS, and compared to sham stimulation as an intraindividual control condition. Results: TMS-evoked N100 amplitude decreased during 1 Hz-rTMS and, at the group level, reached a stable plateau after approximately 500 pulses. N100 amplitude to supra-threshold single pulses post rTMS confirmed the amplitude reduction in comparison to the pre-rTMS level while sham stimulation had no influence. EEG source analysis indicated that the TMS-evoked N100 change reflected rTMS effects in the stimulated motor cortex. Amplitude changes in TMS-evoked N100 and MEPs (pre versus post 1 Hz-rTMS) correlated significantly, but this correlation was also found for pre versus post sham stimulation. Conclusion: The TMS-evoked N100 represents a promising candidate marker to monitor rTMS effects on cortical excitability in children with ADHD. TMS-evoked N100 can be employed to monitor real-time effects of TMS for subthreshold intensities. Though TMS-evoked N100 was a more sensitive parameter for rTMS-specific changes than MEPs in our sample, further studies are necessary to demonstrate whether clinical rTMS effects can be predicted from rTMS-induced changes in TMS-evoked N100 amplitude and to clarify the relationship between rTMS-induced changes in TMS-evoked N100 and MEP amplitudes. The TMS-evoked N100 amplitude reduction after 1 Hz-rTMS could either reflect a globally decreased cortical response to the TMS pulse or a specific decrease in inhibition

Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory

We study the approximation of general multiobjective optimization problems with the help of scalarizations. Existing results state that multiobjective minimization problems can be approximated well by norm-based scalarizations. However, for multiobjective maximization problems, only impossibility results are known so far. Countering this, we show that all multiobjective optimization problems can, in principle, be approximated equally well by scalarizations. In this context, we introduce a transformation theory for scalarizations that establishes the following: Suppose there exists a scalarization that yields an approximation of a certain quality for arbitrary instances of multiobjective optimization problems with a given decomposition specifying which objective functions are to be minimized / maximized. Then, for each other decomposition, our transformation yields another scalarization that yields the same approximation quality for arbitrary instances of problems with this other decomposition. In this sense, the existing results about the approximation via scalarizations for minimization problems carry over to any other objective decomposition -- in particular, to maximization problems -- when suitably adapting the employed scalarization. We further provide necessary and sufficient conditions on a scalarization such that its optimal solutions achieve a constant approximation quality. We give an upper bound on the best achievable approximation quality that applies to general scalarizations and is tight for the majority of norm-based scalarizations applied in the context of multiobjective optimization. As a consequence, none of these norm-based scalarizations can induce approximation sets for optimization problems with maximization objectives, which unifies and generalizes the existing impossibility results concerning the approximation of maximization problems

Drosophila Rhodopsin 7 can partially replace the structural role of Rhodopsin 1, but not its physiological function

Rhodopsin 7 (Rh7), a new invertebrate Rhodopsin gene, was discovered in the genome of Drosophila melanogaster in 2000 and thought to encode for a functional Rhodopsin protein. Indeed, Rh7 exhibits most hallmarks of the known Rhodopsins, except for the G-protein-activating QAKK motif in the third cytoplasmic loop that is absent in Rh7. Here, we show that Rh7 can partially substitute Rh1 in the outer receptor cells (R1-6) for rhabdomere maintenance, but that it cannot activate the phototransduction cascade in these cells. This speaks against a role of Rh7 as photopigment in R1-6, but does not exclude that it works in the inner photoreceptor cells

Declining mortality following acute myocardial infarction in the Department of Veterans Affairs Health Care System

<p>Abstract</p> <p>Background</p> <p>Mortality from acute myocardial infarction (AMI) is declining worldwide. We sought to determine if mortality in the Veterans Health Administration (VHA) has also been declining.</p> <p>Methods</p> <p>We calculated 30-day mortality rates between 2004 and 2006 using data from the VHA External Peer Review Program (EPRP), which entails detailed abstraction of records of all patients with AMI. To compare trends within VHA with other systems of care, we estimated relative mortality rates between 2000 and 2005 for all males 65 years and older with a primary diagnosis of AMI using administrative data from the VHA Patient Treatment File and the Medicare Provider Analysis and Review (MedPAR) files.</p> <p>Results</p> <p>Using EPRP data on 11,609 patients, we observed a statistically significant decline in adjusted 30-day mortality following AMI in VHA from 16.3% in 2004 to 13.9% in 2006, a relative decrease of 15% and a decrease in the odds of dying of 10% per year (p = .011). Similar declines were found for in-hospital and 90-day mortality.</p> <p>Based on administrative data on 27,494 VHA patients age 65 years and older and 789,400 Medicare patients, 30-day mortality following AMI declined from 16.0% during 2000-2001 to 15.7% during 2004-June 2005 in VHA and from 16.7% to 15.5% in private sector hospitals. After adjusting for patient characteristics and hospital effects, the overall relative odds of death were similar for VHA and Medicare (odds ratio 1.02, 95% C.I. 0.96-1.08).</p> <p>Conclusion</p> <p>Mortality following AMI within VHA has declined significantly since 2003 at a rate that parallels that in Medicare-funded hospitals.</p

A new device for monitoring individual activity rhythms of honey bees reveals critical effects of the social environment on behavior

Chronobiological studies of individual activity rhythms in social insects can be constrained by the artificial isolation of individuals from their social context. We present a new experimental set-up that simultaneously measures the temperature rhythm in a queen-less but brood raising mini colony and the walking activity rhythms of singly kept honey bees that have indirect social contact with it. Our approach enables monitoring of individual bees in the social context of a mini colony under controlled laboratory conditions. In a pilot experiment, we show that social contact with the mini colony improves the survival of monitored young individuals and affects locomotor activity patterns of young and old bees. When exposed to conflicting Zeitgebers consisting of a light-dark (LD) cycle that is phase-delayed with respect to the mini colony rhythm, rhythms of young and old bees are socially synchronized with the mini colony rhythm, whereas isolated bees synchronize to the LD cycle. We conclude that the social environment is a stronger Zeitgeber than the LD cycle and that our new experimental set-up is well suited for studying the mechanisms of social entrainment in honey bees

The pigment-dispersing factor neuronal network systematically grows in developing honey bees

The neuropeptide pigment-dispersing factor (PDF) plays a prominent role in the circadian clock of many insects including honey bees. In the honey bee brain, PDF is expressed in about 15 clock neurons per hemisphere that lie between the central brain and the optic lobes. As in other insects, the bee PDF neurons form wide arborizations in the brain, but certain differences are evident. For example, they arborize only sparsely in the accessory medulla (AME), which serves as important communication center of the circadian clock in cockroaches and flies. Furthermore, all bee PDF neurons cluster together, which makes it impossible to distinguish individual projections. Here, we investigated the developing bee PDF network and found that the first three PDF neurons arise in the third larval instar and form a dense network of varicose fibers at the base of the developing medulla that strongly resembles the AME of hemimetabolous insects. In addition, they send faint fibers toward the lateral superior protocerebrum. In last larval instar, PDF cells with larger somata appear and send fibers toward the distal medulla and the medial protocerebrum. In the dorsal part of the medulla serpentine layer, a small PDF knot evolves from which PDF fibers extend ventrally. This knot disappears during metamorphosis and the varicose arborizations in the putative AME become fainter. Instead, a new strongly stained PDF fiber hub appears in front of the lobula. Simultaneously, the number of PDF neurons increases and the PDF neuronal network in the brain gets continuously more complex

Microfluidic Single-Cell Analysis Platform for Biotechnological Process Development

Grünberger A, Probst C, Helfrich S, et al. Microfluidic Single-Cell Analysis Platform for Biotechnological Process Development. In: MicroTAS 2014. San Diego, California: CBM Society; 2014: 3 p

Single-cell Bioreactors boost Bioprocess Development: New Insights into Cellular Metabolism

Kohlheyer D, Grünberger A, Probst C, et al. Single-cell Bioreactors boost Bioprocess Development: New Insights into Cellular Metabolism. Presented at the Metabolic Engineering X, Vancouver, Canada